An improved algorithm for combinatorial multi-parametric quadratic programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An improved algorithm for combinatorial multi-parametric quadratic programming

The goal of multi-parametric quadratic programming (mpQP) is to compute analytic solutions to parameter-dependent constrained optimization problems, e.g., in the context of explicit linear MPC. We propose an improved combinatorial mpQP algorithm that is based on implicit enumeration of all possible optimal active sets and a simple saturation matrix pruning criterion which uses geometric propert...

متن کامل

An algorithm for multi-parametric quadratic programming and explicit MPC solutions

Explicit solutions to constrained linear MPC problems can be obtained by solving multi-parametric quadratic programs (mp-QP) where the parameters are the components of the state vector. We study the properties of the polyhedral partition of the state-space induced by the multiparametric piecewise linear solution and propose a new mp-QP solver. Compared to existing algorithms, our approach adopt...

متن کامل

Experiments in Multi-parametric Quadratic Programming

The paper deals with a short presentation of the basic ideas concerning the multiparametric quadratic programming (mp-QP) problems. The model predictive control is considered also as particular mp-QP problem. Since the solutions to mp-QP problems can be expressed as piecewise affine linear functions of the state, a new implementation in terms of adaptive network-based fuzzy inference systems is...

متن کامل

A Combinatorial Active Set Algorithm for Linear and Quadratic Programming

We propose an algorithm for linear programming, which we call the Sequential Projection algorithm. This new approach is a primal improvement algorithm that keeps both a feasible point and an active set, which uniquely define an improving direction. Like the simplex method, the complexity of this algorithm need not depend explicitly on the size of the numbers of the problem instance. Unlike the ...

متن کامل

A Fast Suboptimal Multi Parametric Quadratic Programming Algorithm for Predictive Control

Multi parameteric quadratic programming gives a full offline solution to a time varying quadratic programming (QP) problem arising during constrained predictive control. However, coding and implementation of this solution may be more burdensome than simply solving the original QP. This paper proposes an algorithm, which by accepting a small amount of suboptimality in the predicted control traje...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2013

ISSN: 0005-1098

DOI: 10.1016/j.automatica.2013.02.022